A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
نویسندگان
چکیده
Given an undirected and vertex weighted graph G, the Weighted Feedback Vertex Problem (WFVP) consists in finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F . The WFVP on general graphs is known to be NP-hard. In this paper we introduce a new class of graphs, namely the diamond graphs, and give a linear time algorithm to
منابع مشابه
Minimum Weighted Feedback Vertex Set on Diamonds
Given a vertex weighted graph G, a minimum Weighted Feedback Vertex Set (MWFVS) is a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F . The MWFVS on general graph is known to be NP-hard. In this paper we introduce a new class of graphs, namely the diamond graphs, and give a linear time algorithm to solve MWFVS on it. We will discuss, moreove...
متن کاملA Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Problem (WFVP) consists of finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F . The WFVP on general graphs is known to be NP-hard and to be polynomially solvable on some special classes of graphs (e.g., interval graphs, co-comparability graphs, di...
متن کاملA memetic algorithm for the weighted feedback vertex set problem
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Set Problem consists of finding the subset F ⊆ V of vertices, with minimum weight, whose removal results in an acyclic graph. Finding the minimum feedback vertex set in a graph is an important combinatorial problem that has a variety of real applications. In this paper we introduce a memetic algorithm for th...
متن کامل0333 - 3590 Improved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). For unweighted graphs, our algorithm either constructs a feedback vertex set of size bounded by k in a given graph G, or reports that no such a feedback vertex set exists in G. For weighted graphs, our algorithm either constructs a minimum-...
متن کاملAn Algorithm to find a Minimum Feedback Vertex Set of an Interval Graph
In an undirected graph, the feedback vertex set problem is to find a set of vertices of minimum cardinality whose removal makes the graph acyclic (connected or disconnected). This problem is known to be NP-hard for general graph. In this paper, we proposed two algorithms for finding the minimum feedback vertex set on interval graphs. The first algorithm is for unweighted case and takes O(n + m)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 94 شماره
صفحات -
تاریخ انتشار 2005